Programming complexity

Results: 456



#Item
351Chapter 1: An Introduction to Approximation Algorithms (cp. Williamson & Shmoys, Chapter 1) 4

Chapter 1: An Introduction to Approximation Algorithms (cp. Williamson & Shmoys, Chapter 1) 4

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2012-11-23 06:22:49
352Minimizing communication in all-pairs shortest paths Edgar Solomonik Aydin Buluc James Demmel

Minimizing communication in all-pairs shortest paths Edgar Solomonik Aydin Buluc James Demmel

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2013-02-13 15:02:13
353MERLIN A polynomial solution for the Traveling Salesman Problem Dr. Joachim Mertz, [removed]

MERLIN A polynomial solution for the Traveling Salesman Problem Dr. Joachim Mertz, [removed]

Add to Reading List

Source URL: www.merlins-world.de

Language: English - Date: 2007-04-13 17:27:56
354The Timetable Constrained Distance Minimization Problem Rasmus V. Rasmussen1 and Michael A. Trick2 1 Department of Operations Research, University of Aarhus, Ny Munkegade, Building 1530, 8000 Aarhus C, Denmark

The Timetable Constrained Distance Minimization Problem Rasmus V. Rasmussen1 and Michael A. Trick2 1 Department of Operations Research, University of Aarhus, Ny Munkegade, Building 1530, 8000 Aarhus C, Denmark

Add to Reading List

Source URL: mat.gsia.cmu.edu

Language: English - Date: 2007-11-25 18:03:30
355Approximation Algorithms (ADM III)

Approximation Algorithms (ADM III)

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2012-11-30 06:01:55
356MATTHIAS GERDTS COMBINATORIAL OPTIMISATION MSM 3M02b Address of the Author:

MATTHIAS GERDTS COMBINATORIAL OPTIMISATION MSM 3M02b Address of the Author:

Add to Reading List

Source URL: www.unibw.de

Language: English - Date: 2013-09-30 11:30:30
357A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the m

A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the m

Add to Reading List

Source URL: page.math.tu-berlin.de

Language: English
358RANK-TWO RELAXATION HEURISTICS FOR MAX-CUT AND OTHER BINARY QUADRATIC PROGRAMS∗ SAMUEL BURER† , RENATO D.C. MONTEIRO‡ , AND YIN ZHANG§ Abstract. The Goemans-Williamson randomized algorithm guarantees a high-qualit

RANK-TWO RELAXATION HEURISTICS FOR MAX-CUT AND OTHER BINARY QUADRATIC PROGRAMS∗ SAMUEL BURER† , RENATO D.C. MONTEIRO‡ , AND YIN ZHANG§ Abstract. The Goemans-Williamson randomized algorithm guarantees a high-qualit

Add to Reading List

Source URL: www.caam.rice.edu

Language: English - Date: 2011-06-15 15:55:38
359A Local Search Approximation Algorithm for k-Means Clustering∗ Tapas Kanungo† David M. Mount‡ Nathan S. Netanyahu§

A Local Search Approximation Algorithm for k-Means Clustering∗ Tapas Kanungo† David M. Mount‡ Nathan S. Netanyahu§

Add to Reading List

Source URL: www.kanungo.com

Language: English - Date: 2006-09-07 03:00:00
360INDEX Next Fit, 4{5, 25, 27{30 Smart, 28, 30 Next Fit Decreasing, 17, 41, 44 Next-K Fit, 5, 9{11, 25, 28

INDEX Next Fit, 4{5, 25, 27{30 Smart, 28, 30 Next Fit Decreasing, 17, 41, 44 Next-K Fit, 5, 9{11, 25, 28

Add to Reading List

Source URL: www.math.nsc.ru

Language: English - Date: 2005-03-04 05:08:14